A New Method to Determine the Queue Length Distribution at an ATM Multiplexer
نویسندگان
چکیده
In this paper, we develop a simple analytical technique to determine P (fQ > qg), the tail of the queue length distribution, at an ATM multiplexer. The ATM multiplexer is modeled as a uid queue serving a large number of independent sources. Our method is based on the central limit theorem and the maximum variance approximation, and enables us to avoid the state explosion problem. The approach is quite general and not limited by a Markovian framework. We apply our analytical method to study the bu er behavior for various tra c sources such as multiplexed homogeneous and heterogeneous Markov modulated sources, sources that are correlated at multiple time scales, sources whose autocorrelation function exhibits heavy (sub-exponential) tail behavior, and sources generated from real MPEG-encoded video sequences.
منابع مشابه
Evaluating the Queue Length Distribution of an ATM Multiplexer with Multiple Time Scale Arrivals
For an ATM multiplexer we develop a recursive asymptotic expansion method for approximating the queue length distribution and investigate the radius of convergence of the queue asymptotic expansion series. The analysis focuses on “small” to “moderate” buffer sizes under the conditions of strictly stable multiple time scale arrivals. For a class of examples we analytically determine the radius o...
متن کاملEstimation of Buffer Overflow Probabilities and Economies of Scale in ATM Multiplexers by Analysis of a Model of Packetized Voice Traffic
Estimation of Buffer Overflow Probabilities and Economies of Scale in ATM M ultiplexers by Analysis of a M odel of Packetized Voice Traffic by Paul J. Farrell We obtain upper bounds on the probability of buffer overflow for an ATM multiplexer of L identical packetized voice sources The multiplexer is modelled by a FCFS single server queue The arrivals at the multiplexer are a homogenous superpo...
متن کاملExact Relation between Loss Probability and Queue Length in an Atm Multiplexer with Correlated Arrivals and Periodic Vacations
This paper considers discrete-time single-server queueing systems where the arrivals of cells are a timecorrelated arrival process and the service for cells is done every R slots. In particular, the arrivals is governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. A typical example of the arrival processes satisfying t...
متن کاملOn the Dependence of the Queue Tail Distribution on MultipleTime Scales of ATM Multiplexers
For a family of arrival processes A ; > 0, we give suucient conditions under which the queue length distribution satisses lim !0 lim x!1 ? log IPPQ x]=x= ; for some > 0 called the asymptotic decay rate. Using this result we show, under strict stability conditions , that the asymptotic decay rate of an ATM network multiplexer does not depend on the slow time scale statistics. However, the rate a...
متن کاملDynamics of TCP in congested ATM multiplexers
In this paper we investigate the dynamic behavior of multiplexer queues for TCP traac in simple ATM networks. Our results are based on theoretical investigations which are proved by simulations. We propose a cell based queue length evaluation for TCP traac over ATM using service c ategorie UBR. In case of cell losses at the ATM multiplexer we estimate packet loss probabilities and discuss the i...
متن کامل